Generalized quantifiers in models of set theory
نویسندگان
چکیده
منابع مشابه
Theory Comparison for Generalized Quantifiers
Premises and conclusions in classical syllogistic reasoning are formed using one of four quantifiers (All, Some, Some not, None). In everyday communication and reasoning, however, statements such as “most” and “few” are formed as well. So far only Chater and Oaksford’s (1999) Probability Heuristics Model (PHM) makes predictions for these so-called generalized quantifiers. In this article we (i)...
متن کاملGeneralized Algebra-Valued Models of Set Theory
We generalize the construction of lattice-valued models of set theory due to Takeuti, Titani, Kozawa and Ozawa to a wider class of algebras and show that this yields a model of a paraconsistent logic that validates all axioms of the negation-free fragment of Zermelo-Fraenkel set theory. §
متن کاملStable Models of Formulas with Generalized Quantifiers
Applications of answer set programming motivated various extensions of the stable model semantics, for instance, to incorporate aggregates and abstract constraint atoms, to facilitate interface with external information sources, such as ontology descriptions, and to integrate with other computing paradigms, such as constraint solving. This paper provides a uniform view on some of these extensio...
متن کاملModel Generation for Generalized Quantifiers via Answer Set Programming
For the semantic evaluation of natural language sentences, in particular those containing generalized quantifiers, we subscribe to the generate and test methodology to produce models of such sentences. These models are considered as means by which the sentences can be interpreted within a natural language processing system. The goal of this paper is to demonstrate that answer set programming is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Mathematicae
سال: 1980
ISSN: 0016-2736,1730-6329
DOI: 10.4064/fm-106-3-153-161